An Efficient Solution to the Millionaires' Problem Based on Homomorphic Encryption
نویسندگان
چکیده
We proposed a two-round protocol for solving the Millionaires’ Problem in the setting of semi-honest parties. Our protocol uses either multiplicative or additive homomorphic encryptions. Previously proposed protocols used additive or XOR homomorphic encryption schemes only. The computation and communication costs of our protocol are in the same asymptotic order as those of the other efficient protocols. Nevertheless, since multiplicative homomorphic encryption scheme is more efficient than an additive one practically, our construction saves computation time and communication bandwidth in practicality.
منابع مشابه
Secure Integer Comparisons Using the Homomorphic Properties of Prime Power Subgroups
Secure multi party computation allows two or more parties to jointly compute a function under encryption without leaking information about their private inputs. These secure computations are vital in many fields including law enforcement, secure voting and bioinformatics because the privacy of the information is of paramount importance. One common reference problem for secure multi party comput...
متن کاملSome Efficient Solutions to Yao's Millionaire Problem
We present three simple and efficient protocol constructions to solve Yao’s Millionaire Problem when the parties involved are non-colluding and semi-honest. The first construction uses a partially homomorphic Encryption Scheme and is a 4-round scheme using 2 encryptions, 2 homomorphic circuit evaluations (subtraction and XOR) and a single decryption. The second construction uses an untrusted th...
متن کاملCo-operative Private Equality Test
We study the following problem: party A’s secret input is a, party B ’s secret input is b, and party C ’s input is empty; they want to know if a = b with restriction that A and B should not learn anything more than what is implied by their secret inputs and the comparison result, and C should not learn anything about a or b except if a = b. This problem can be seen as a variant of the socialist...
متن کاملEfficient Oblivious Computation Techniques for Privacy-Preserving Mobile Applications
The growth of smartphone capability has led to an explosion of new applications. Many of the most useful apps use context-sensitive data, such as GPS location or social network information. In these cases, users may not be willing to release personal information to untrusted parties. Currently, the solutions to performing computation on encrypted inputs use garbled circuits combined with a vari...
متن کاملCryptanalysis of Brenner et al.'s Somewhat Homomorphic Encryption Scheme
Recently, Brenner et al. proposed a symmetric somewhat homomorphic encryption scheme and applied it to solve some practical problems, such as the Millionaires’ problem, which only need to evaluate circuits of limited depth. It is claimed that the security of their scheme is built on the hardness of integer factorization. In this paper, we use the Euclidean Greatest Common Divisor (GCD) algorith...
متن کامل